New Results for Lazy Bureaucrat Scheduling Problem

Lazy bureaucrat scheduling is a new class of scheduling problems that was introduced in 1]. In this class of scheduling problems, there is one employee (or more) who should perform the assigned jobs; the objective of the employee is to minimize the amount of work he does and be as ineecient as possible (he is \Lazy"). He is subject to a constraint that he should be busy when there is work to be done. In this paper, we rst brieey deene the \lazy bureaucrat scheduling" model as it is introduced in 1] and present some old results. We then present our extensions and new results on this problem. We show that when all jobs have unit length, the latest deadline rst policy minimizes the amount of executed work both in a single processor and multiple processors; so optimal schedule can be found in polynomial time. We also prove that if all jobs have a common release time and the objective function is to minimize the weighted sum of completed jobs, the optimum schedule can be found in polynomial time.